Attribute Exploration with Background Knowledge
نویسنده
چکیده
منابع مشابه
Attribute Exploration of Many-Valued Context with SAT
This paper proposes an encoding a background-implying problem in attribute exploration of manyvalued context into a SAT problem. A background-implying problem is whether an attribute implication is implied by some other attribute implications and is also compatible with background knowledge. In the case of manyvalued context, the background knowledge will be its scales which are also formal con...
متن کاملAttribute Exploration with Fuzzy Attributes and Background Knowledge
Attribute exploration is a formal concept analytical tool for knowledge discovery by interactive determination of the implications holding between a given set of attributes. The corresponding algorithm queries the user in an efficient way about the implications between the attributes. The result of the exploration process is a representative set of examples for the entire theory and a set of im...
متن کاملExploring Attributes with Domain Knowledge in Formal Concept Analysis
Recent literature reports the growing interests in data analysis using Formal Concept Analysis (FCA), in which data is represented in the form of object and attribute relations. FCA analyzes and then subsequently visualizes the data based on duality called Galois connection. Attribute exploration is a knowledge acquisition process in FCA, which interactively determines the implications holding ...
متن کاملAttribute Exploration with Background Implications and Exceptions
Implications between attributes can represent knowledge about objects in a speciied context. This knowledge representation is especially useful when it is not possible to list all speciied objects. Attribute exploration is a tool of formal concept analysis that supports the acquisition of this knowledge. For a speciied context this interactive procedure determines a minimal list of valid implic...
متن کاملAbstract Attribute Exploration with Partial Object Descriptions
Attribute exploration has been investigated in several studies, with particular emphasis on the algorithmic aspects of this knowledge acquisition method. In its basic version the method itself is rather simple and transparent. But when background knowledge and partially described counterexamples are admitted, it gets more difficult. Here we discuss this case in an abstract, somewhat “axiomatic”...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 217 شماره
صفحات -
تاریخ انتشار 1999